Clique Centrality and Global Clique Centrality of Graphs

We formally introduce in this paper two parameters graph theory, namely, clique centrality and global centrality. Let G be a finite, simple undirected of order n. A is nonempty subset W \(\subseteq\) V (G) such that the subgraph \(\langle\)W\(\rangle\)G induced by complete. The maximum size any containing vertex u \(\in\) called G. Normalizing sum centralities all vertices will lead us to G, whose value ranges from \(\frac{1}{m}\) 1. In paper, we study some general properties then evaluate it for parameterized families graphs.